From automatic structures to automatic groups
نویسندگان
چکیده
منابع مشابه
From automatic structures to automatic groups
In this paper we introduce the concept of a Cayley graph automatic group (CGA group or graph automatic group, for short) which generalizes the standard notion of an automatic group. Like the usual automatic groups graph automatic ones enjoy many nice properties: these group are invariant under the change of generators, they are closed under direct and free products, certain types of amalgamated...
متن کاملAutomatic Structures
We study definability and complexity issues for automatic and ω-automatic structures. These are, in general, infinite structures but they can be finitely presented by a collection of automata. Moreover, they admit effective (in fact automatic) evaluation of all first-order queries. Therefore, automatic structures provide an interesting framework for extending many algorithmic and logical method...
متن کاملMeasuring Closeness Between Cayley Automatic Groups and Automatic Groups
In this paper we introduce a way to estimate a level of closeness of Cayley automatic groups to the class of automatic groups using a certain numerical characteristic. We characterize Cayley automatic groups which are not automatic in terms of this numerical characteristic and then study it for the lamplighter group, the Baumslag–Solitar groups and the Heisenberg group.
متن کاملAutomatic Structures and Boundaries for Graphs of Groups
We study the synchronous and asynchronous automatic structures on the fundamental group of a graph of groups in which each edge group is finite. Up to a natural equivalence relation, the set of biautomatic structures on such a graph product bijects to the product of the sets of biautomatic structures on the vertex groups. The set of automatic structures is much richer. Indeed, it is dense in th...
متن کاملAdvice Automatic Structures and Uniformly Automatic Classes
We study structures that are automatic with advice. These are structures that admit a presentation by finite automata (over finite or infinite words or trees) with access to an additional input, called an advice. Over finite words, a standard example of a structure that is automatic with advice, but not automatic in the classical sense, is the additive group of rational numbers (Q,+). By using ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Groups, Geometry, and Dynamics
سال: 2014
ISSN: 1661-7207
DOI: 10.4171/ggd/221